On Continuous Distributions and Parameter Estima- tion in Probabilistic Logic Programs
نویسنده
چکیده
In the last decade remarkable progress has been made on combining statistical machine learning techniques, reasoning under uncertainty, and relational representations. The branch of Artificial Intelligence working on the synthesis of these three areas is known as statistical relational learning or probabilistic logic learning. ProbLog, one of the probabilistic frameworks developed, is an extension of the logic programming language Prolog with independent random variables that are defined by annotating logical facts with probabilities. The separation of the logical and probabilistic part of the model is based on the distribution semantics. Driven by the demand for models that are able to handle continuous values and can be automatically optimized on training data, this thesis introduces several algorithms and extensions to the ProbLog language. Continuous-valued data arise naturally in robotics, human activity recognition and bio-medical applications. Moreover, the models used are complex and the available data is often noisy and incomplete. Hence tuning a model towards the specifics of the environment can hardly be done manually. This poses two crucial challenges for probabilistic programming languages such as ProbLog: processing continuous values and being able to learn from training data. This thesis makes four main contributions to the field of probabilistic logic learning. Hybrid ProbLog is an extension for ProbLog with continuous facts that allows for exact inference. Distributional Programs combine elements of ProbLog, Hybrid ProbLog and CP-Logic into a very expressive language for dealing with continuous distributions. A sampling-based inference algorithm is used to answer conditional queries, while the deterministic information in the program guides the sampling process. LFE-ProbLog is able to learn the parameters of a ProbLog program from queries and proofs, while LFI-ProbLog is optimized to learn the parameters from partial interpretations. Together they cover the standard learning settings considered in PLL. All learning approaches have been evaluated in several relational real-world domains.
منابع مشابه
Parameter Learning in PRISM Programs with Continuous Random Variables
Probabilistic Logic Programming (PLP), exemplified by Sato and Kameya’s PRISM, Poole’s ICL, De Raedt et al’s ProbLog and Vennekens et al’s LPAD, combines statistical and logical knowledge representation and inference. Inference in these languages is based on enumerative construction of proofs over logic programs. Consequently, these languages permit very limited use of random variables with con...
متن کاملGenerative Modeling with Failure in PRISM
PRISM is a logic-based Turing-complete symbolicstatistical modeling language with a built-in parameter learning routine. In this paper,we enhance the modeling power of PRISM by allowing general PRISM programs to fail in the generation process of observable events. Introducing failure extends the class of definable distributions but needs a generalization of the semantics of PRISM programs. We p...
متن کاملInference and Learning in Probabilistic Logic Programs with Continuous Random Variables
of the Dissertation Inference and Learning in Probabilistic Logic Programs with Continuous Random Variables
متن کاملA Method to Expand Family of Continuous Distributions based on Truncated Distributions
Abstract: A new method to generate various family of distributions is introduced. This method introduces a new two-parameter extension of the exponential distribution to illustrate its application. Some statistical and reliability properties of the new distribution, including explicit expressions for the moments, quantiles, mode, moment generating function, mean residual lifetime, stochas...
متن کاملNegation Without Negation in Probabilistic Logic Programming
Probabilistic logic programs without negation can have cycles (with a preference for false), but cannot represent all conditional distributions. Probabilistic logic programs with negation can represent arbitrary conditional probabilities, but with cycles they create logical inconsistencies. We show how allowing negative noise probabilities allows us to represent arbitrary conditional probabilit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011